Solving Fuzzy Step Fixed Charge Transportation Problems via Metaheuristics

نویسندگان

  • F. Rajabi
  • S. E. Najafi
  • M. Hajiaghaei-Keshteli
  • S. Molla-Alizadeh-Zavardehi
چکیده

In the present paper the step fixed charge transportation problem under uncertainty, particularly when variable and fixed cost are given in fuzzy forms, is formulated. In order to solve the problem, two metaheuristic, simulated annealing algorithm (SA) and variable neighbourhood search (VNS), are developed for this NP-hard problem. Due to the significant role of parameters and operators on the algorithm’s quality, an extensive calibration in both SA and VNS is carried out with the aid of a set of experimental design. Through extensive computational experiments, appropriate parameter values of the proposed algorithms were chosen. For this purpose, twenty eight problems with different configuration have been generated at random and then the effectiveness of the proposed algorithms was evaluated using the relative percentage deviation (RPD) method. Article history : Received: April 18, 2013 Revised: July 10, 2013 Accepted: August 27, 2013

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the Fixed Charge Transportation Problem by New Heuristic Approach

The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...

متن کامل

SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM

In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...

متن کامل

An Approximation Method for Fuzzy Fixed-Charge Transportation Problem

In this paper, we develop the fuzzy fixed charge transportation problem when the costs are the fuzzy numbers. The first step it transform into the classical fuzzy transportation problem. The next, we obtain the best approximation fuzzy on the optimal value of the fuzzy fixed-charge transportation problem. This method obtains a lower and upper bounds both on the fuzzy optimal value of the fuzzy ...

متن کامل

On approximation of the ‎f‎ully fuzzy fixed charge transportation ‎problem

In the literature hardly any attention is paid to solving a fuzzy fixed charge transportation problem. In this paper, we consider the fully fixed-charge transportation problem and try to find both the lower and upper bounds on the fuzzy optimal value of such a problem in which all of the parameters are triangular fuzzy numbers. To illustrate the proposed method, a numerical example is ‎presented.‎

متن کامل

AN ELECTROMAGNETISM-LIKE ALGORITHM FOR FIXED CHARGE SOLID TRANSPORTATION PROBLEM

Fixed charge solid transportation problem (FCSTP) is one of the main and most important problems in transportation and network research areas. To tackle such an NP-hard problem, An Electromagnetism-like algorithm (EM) is employed. To the best of our knowledge, EM has been considered for any kind of transportation problems. Due to the significant role of parameters on the algorithm’s performance...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013